A binary neural shape matcher using Johnson Counters and chain codes

نویسندگان

  • Victoria J. Hodge
  • Simon O'Keefe
  • Jim Austin
چکیده

Images may be matched as whole images or using shape matching. Shape matching requires: identifying edges in the image, finding shapes using the edges and representing the shapes using a suitable metric. A Laplacian edge detector is simple and efficient for identifying the edges of shapes. Chain codes describe shapes using sequences of numbers and may be matched simply, accurately and flexibly. We couple this with the efficiency of a binary associative-memory neural network. We demonstrate shape matching using the neural network to index and match chain codes where the chain code elements are represented by Johnson codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reference ID A Binary Neural Shape Matcher using Johnson Counters and Chain Codes

In this paper, we introduce a neural network-based shape matching algorithm that uses Johnson Counter codes coupled with chain codes. Shape matching is a fundamental requirement in content-based image retrieval systems. Chain codes describe shapes using sequences of numbers. They are simple and flexible. We couple this power with the efficiency and flexibility of a binary associative-memory neu...

متن کامل

On Linear Codes over Z2s

In an earlier paper the authors studied simplex codes of type α and β over Z4 and obtained some known binary linear and nonlinear codes as Gray images of these codes. In this correspondence, we study weight distributions of simplex codes of type α and β over Z2s . The generalized Gray map is then used to construct binary codes. The linear codes meet the Griesmer bound and a few non-linear codes...

متن کامل

Estimation of Binary Infinite Dilute Diffusion Coefficient Using Artificial Neural Network

In this study, the use of the three-layer feed forward neural network has been investigated for estimating of infinite dilute diffusion coefficient ( D12 ) of supercritical fluid (SCF), liquid and gas binary systems. Infinite dilute diffusion coefficient was spotted as a function of critical temperature, critical pressure, critical volume, normal boiling point, molecular volume in normal boilin...

متن کامل

In-Place Binary Counters

We introduce a binary counter that supports increments and decrements in O(1) worst-case time per operation. (We assume that arithmetic operations on an index variable that is stored in one computer word can be performed in O(1) time each.) To represent any integer in the range from 0 to 2−1, our counter uses an array of at most n bits plus few words of dlg(1 +n)e bits each. Extended-regular an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 72  شماره 

صفحات  -

تاریخ انتشار 2009